Discovering Relations among Named Entities by Detecting Community Structure

PACLIC 20 / Wuhan, China / 1-3 November, 200

Variational Relational Point Completion Network for Robust 3D Classification

Real-scanned point clouds are often incomplete due to viewpoint, occlusion, and noise, which hampers 3D geometric modeling and perception. Existing point cloud completion methods tend to generate global shape skeletons and hence lack fine local details. Furthermore, they mostly learn a deterministic partial-to-complete mapping, but overlook structural relations in man-made objects. To tackle these challenges, this paper proposes a variational framework, Variational Relational point Completion Network (VRCNet) with two appealing properties: 1) Probabilistic Modeling. In particular, we propose a dual-path architecture to enable principled probabilistic modeling across partial and complete clouds. One path consumes complete point clouds for reconstruction by learning a point VAE. The other path generates complete shapes for partial point clouds, whose embedded distribution is guided by distribution obtained from the reconstruction path during training. 2) Relational Enhancement. Specifically, we carefully design point self-attention kernel and point selective kernel module to exploit relational point features, which refines local shape details conditioned on the coarse completion. In addition, we contribute multi-view partial point cloud datasets (MVP and MVP-40 dataset) containing over 200,000 high-quality scans, which render partial 3D shapes from 26 uniformly distributed camera poses for each 3D CAD model. Extensive experiments demonstrate that VRCNet outperforms state-of-the-art methods on all standard point cloud completion benchmarks. Notably, VRCNet shows great generalizability and robustness on real-world point cloud scans. Moreover, we can achieve robust 3D classification for partial point clouds with the help of VRCNet, which can highly increase classification accuracy.Comment: 12 pages, 10 figures, accepted by PAMI. project webpage: https://mvp-dataset.github.io/. arXiv admin note: substantial text overlap with arXiv:2104.1015

Content Addressable Memories and Transformable Logic Circuits Based on Ferroelectric Reconfigurable Transistors for In-Memory Computing

As a promising alternative to the Von Neumann architecture, in-memory computing holds the promise of delivering high computing capacity while consuming low power. Content addressable memory (CAM) can implement pattern matching and distance measurement in memory with massive parallelism, making them highly desirable for data-intensive applications. In this paper, we propose and demonstrate a novel 1-transistor-per-bit CAM based on the ferroelectric reconfigurable transistor. By exploiting the switchable polarity of the ferroelectric reconfigurable transistor, XOR/XNOR-like matching operation in CAM can be realized in a single transistor. By eliminating the need for the complementary circuit, these non-volatile CAMs based on reconfigurable transistors can offer a significant improvement in area and energy efficiency compared to conventional CAMs. NAND- and NOR-arrays of CAMs are also demonstrated, which enable multi-bit matching in a single reading operation. In addition, the NOR array of CAM cells effectively measures the Hamming distance between the input query and stored entries. Furthermore, utilizing the switchable polarity of these ferroelectric Schottky barrier transistors, we demonstrate reconfigurable logic gates with NAND/NOR dual functions, whose input-output mapping can be transformed in real-time without changing the layout. These reconfigurable circuits will serve as important building blocks for high-density data-stream processors and reconfigurable Application-Specific Integrated Circuits (r-ASICs). The CAMs and transformable logic gates based on ferroelectric reconfigurable transistors will have broad applications in data-intensive applications from image processing to machine learning and artificial intelligence

IAIFNet: An Illumination-Aware Infrared and Visible Image Fusion Network

Infrared and visible image fusion (IVIF) is used to generate fusion images with comprehensive features of both images, which is beneficial for downstream vision tasks. However, current methods rarely consider the illumination condition in low-light environments, and the targets in the fused images are often not prominent. To address the above issues, we propose an Illumination-Aware Infrared and Visible Image Fusion Network, named as IAIFNet. In our framework, an illumination enhancement network first estimates the incident illumination maps of input images. Afterwards, with the help of proposed adaptive differential fusion module (ADFM) and salient target aware module (STAM), an image fusion network effectively integrates the salient features of the illumination-enhanced infrared and visible images into a fusion image of high visual quality. Extensive experimental results verify that our method outperforms five state-of-the-art methods of fusing infrared and visible images.Comment: Submitted to IEE

SSPFusion: A Semantic Structure-Preserving Approach for Infrared and Visible Image Fusion

Most existing learning-based infrared and visible image fusion (IVIF) methods exhibit massive redundant information in the fusion images, i.e., yielding edge-blurring effect or unrecognizable for object detectors. To alleviate these issues, we propose a semantic structure-preserving approach for IVIF, namely SSPFusion. At first, we design a Structural Feature Extractor (SFE) to extract the structural features of infrared and visible images. Then, we introduce a multi-scale Structure-Preserving Fusion (SPF) module to fuse the structural features of infrared and visible images, while maintaining the consistency of semantic structures between the fusion and source images. Owing to these two effective modules, our method is able to generate high-quality fusion images from pairs of infrared and visible images, which can boost the performance of downstream computer-vision tasks. Experimental results on three benchmarks demonstrate that our method outperforms eight state-of-the-art image fusion methods in terms of both qualitative and quantitative evaluations. The code for our method, along with additional comparison results, will be made available at: https://github.com/QiaoYang-CV/SSPFUSION.Comment: Submitted to IEE

Low-Thermal-Budget Ferroelectric Field-Effect Transistors Based on CuInP2S6 and InZnO

In this paper, we demonstrate low-thermal-budget ferroelectric field-effect transistors (FeFETs) based on two-dimensional ferroelectric CuInP2S6 (CIPS) and oxide semiconductor InZnO (IZO). The CIPS/IZO FeFETs exhibit non-volatile memory windows of ~1 V, low off-state drain currents, and high carrier mobilities. The ferroelectric CIPS layer serves a dual purpose by providing electrostatic doping in IZO and acting as a passivation layer for the IZO channel. We also investigate the CIPS/IZO FeFETs as artificial synaptic devices for neural networks. The CIPS/IZO synapse demonstrates a sizeable dynamic ratio (125) and maintains stable multi-level states. Neural networks based on CIPS/IZO FeFETs achieve an accuracy rate of over 80% in recognizing MNIST handwritten digits. These ferroelectric transistors can be vertically stacked on silicon CMOS with a low thermal budget, offering broad applications in CMOS+X technologies and energy-efficient 3D neural networks

Optimization for Variable Height Wind Farm Layout Model

The optimization of wind farm layouts is very important for the effective utilization of wind resources. A fixed wind turbine hub height in the layout of wind farms leads to a low wind energy utilization and a higher LCOE (levelized cost of electricity). WOMH (Wind Farm Layout Optimization Model Considering Multiple Hub Heights) is proposed in this paper to tackle the above problem. This model is different from the traditional fixed hub height model, as it uses a variable height wind turbine. In WOMH, the Jensen wake and Weibull distribution are used to describe the wake effect on the wind turbines and wind speed distribution, respectively. An algorithm called DEGM (differential evolution and greedy method with multiple strategies) is proposed to solve WOMH, which is NP hard. In the DEGM, seven strategies are designed to adjust the distribution coordinates of wind turbines so that the height of the wind turbines will be arranged from low to high in the wind direction. This layout reduces the Jensen wake effect, thus reducing the value of the LCOE. The experimental results show that in the DEGM, when the number of wind turbines is 5, 10, 20, 30 and 50, the WOMH reduces the LCOE by 13.96%, 12.54%, 8.22%, 6.14% and 7.77% compared with the fixed hub height model, respectively. In addition, the quality of the solution of the DEGM is more satisfactory than that of the three-dimensional greedy algorithm and the DEEM (differential evolution with a new encoding mechanism) algorithm. In the case of five different numbers of wind turbines, the LCOE of DEGM is at least 3.67% lower than that of DEEM, and an average of 6.83% lower than that of three-dimensional greedy. The model and algorithm in this paper provide an effective solution for the field of wind farm layout optimization